Differentiated Protection and Hot/Cold-Aware Data Placement Policies through k-Means Clustering Analysis for 3D-NAND SSDs
نویسندگان
چکیده
3D-NAND flash memory provides high capacity per unit area by stacking 2D-NAND cells having a planar structure. However, because of the nature lamination process, frequency error occurrence varies depending on each layer or physical cell location. This phenomenon becomes more pronounced as number write/erase (Program/Erasure) operations increases. Error correction code (ECC) is used for in majority flash-based storage devices, such SSDs (Solid State Drive). As this method constant level data protection all-flash pages, there limitation memory, where rate Consequently, paper, pages and layers with varying rates are classified into clusters using k-means machine-learning algorithm, cluster assigned different strength. We classify based occurrences measured at end endurance test, areas vulnerable to errors, it shown an example providing differentiated strength adding parity stripe. Furthermore, retention errors identified rates, bit significantly reduced through our hot/cold-aware placement policy. show that proposed differential policies improve reliability lifespan compared existing ECC- RAID-type scheme.
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملA Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملComparative Analysis of k-means and Enhanced K-means clustering algorithm for data mining
IJSER © 2012 http://www.ijser.org Comparative Analysis of k-means and Enhanced K-means clustering algorithm for data mining Neha Aggarwal,Kirti Aggarwal, Kanika gupta ABSTRACT-K-Means Clustering is an immensely popular clustering algorithm for data mining which partitions data into different clusters on the basis of similarity between the data points and aims at maximizing the intra-class simi...
متن کاملBPSO Optimized K-means Clustering Approach for Data Analysis
However, there exist some flaws in classical K-means clustering algorithm. First, the algorithm is sensitive in selecting initial centroids and can be easily trapped at a local minimum with regards to the measurement (the sum of squared errors). Secondly, the KM problem in terms of finding a global minimal sum of the squared errors is NP-hard even when the number of the clusters is equal to 2 o...
متن کاملBPSO Optimized K means Clustering Approach for Medical Data Analysis
Data mining plays a very important role in the analysis of diseases and clustering approach makes it easier to classify the data collected in respective groups. Medicine companies and medical appliance manufacturer are benefitted from these data analysis. Now a days, this is done at a very large scale and has been named as big data analysis in which data size is of many terabytes. Optimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2022
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics11030398